Factorials of Arbitrary Sets of Integers
نویسنده
چکیده
Given any subset of Z we associate to it another set on which we can define one or more (generally independent) abstract factorial functions. These associated sets are studied and arithmetic relations are revealed. In addition, we show that for an abstract factorial function of an infinite subset of Z the series of reciprocals of its factorials is always an irrational number.
منابع مشابه
Factorials of real negative and imaginary numbers - A new perspective
Presently, factorials of real negative numbers and imaginary numbers, except for zero and negative integers are interpolated using the Euler's gamma function. In the present paper, the concept of factorials has been generalised as applicable to real and imaginary numbers, and multifactorials. New functions based on Euler's factorial function have been proposed for the factorials of real negativ...
متن کاملMinimum Aberration Designs for Mixed Factorials in Terms of Complementary Sets
Minimum aberration designs are obtained for two types of mixed-level fractional factorial: (i) (s) × s factorial, and (ii) (s1) × (s2) × s factorial, where s is any prime or prime power, and r, r1, r2 and n are positive integers. Projective geometric tools are employed to find the wordlength pattern of a given design in terms of that of its complementary set. Many useful designs are found
متن کاملCompact Enumeration Formulas for Generalized Partitions
Counting the number of elements in finite sets Si (where i typically ranges over some index set I such as the non–negative integers or a cartesian product of the non–negative integers) is surely one of the oldest and most fundamental problems in mathematics. It is in the nature of the subject that only a few enumeration problems have a compact solution in terms of a simple explicit formula in i...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملAbout a New Kind of Ramanujan-Type Series
where d, k, a, b, c are integers, B(n) = n!−5 C(n) or B(n) = (−1)nn!−5C(n), and C(n) is the product of 5 rising factorials of fractions smaller than unity satisfying the following condition: For every denominator in the fraction of a rising factorial, we must have rising factorials with all possible nonreducible fractions corresponding to that denominator. Taking this into account, we have the ...
متن کامل